Cover Image

Kempe equivalence of 4-colourings of some plane triangulations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Florek, Jan
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C45, 05C10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A sufficient condition for cubic 3-connected plane bipartite graphs to be hamiltonian
by: Florek, Jan
Published: (2023)

Enumeration of plane triangulations with all vertices of degree $3$ or $6$ and a new characterization of akempic triangulations
by: Florek, Jan
Published: (2025)

Spanning bipartite quadrangulations of triangulations of the projective plane
by: Noguchi, Kenta
Published: (2022)

Colouring the 1-skeleton of $d$-dimensional triangulations
by: Planken, Tim
Published: (2024)

On perfect matchings, edge-colourings and eigenvalues of cubic graphs
by: Haemers, Willem H.
Published: (2026)

Counting Small Cycle Double Covers
by: Jooken, Jorik, et al.
Published: (2025)

Sharp isoperimetric inequalities for infinite plane graphs with bounded vertex and face degrees
by: Oh, Byung-Geun
Published: (2020)

Maximum genus embeddings of dense eulerian graphs with specified faces
by: Ellingham, M. N., et al.
Published: (2024)

Odd-Ramsey numbers of Hamilton cycles
by: Boyadzhiyska, Simona, et al.
Published: (2025)

$K_2$-Hamiltonian Graphs: II
by: Goedgebeur, Jan, et al.
Published: (2023)

Bi-eulerian embeddings of graphs and digraphs
by: Ellingham, M. N., et al.
Published: (2024)

On the number of 4-contractible edges in plane triangulations
by: Abe, Toshiki, et al.
Published: (2026)

Generation and New Infinite Families of $K_2$-hypohamiltonian Graphs
by: Goedgebeur, Jan, et al.
Published: (2023)

Optimal stability results on color-biased Hamilton cycles
by: Chen, Wenchong, et al.
Published: (2025)

Kempe equivalence and quadratic toric rings
by: Ohsugi, Hidefumi, et al.
Published: (2023)

Counting $k$-cycles in $5$-connected planar triangulations
by: Agrahari, Gyaneshwar, et al.
Published: (2025)

On the Vertex Decomposability of $r$-Independence Complexes of Trees
by: Sawant, Rutuja
Published: (2026)

A note on interval colourings of graphs
by: Axenovich, Maria, et al.
Published: (2023)

Tight Hamiltonicity from dense links of triples
by: Lang, Richard, et al.
Published: (2024)

On the real-rootedness of the Eulerian transformation
by: Athanasiadis, Christos A.
Published: (2023)

Spanning plane subgraphs of $1$-plane graphs
by: Noguchi, Kenta, et al.
Published: (2024)

On canonical sandpile actions of embedded graphs
by: Tóthmérész, Lilla
Published: (2025)

Every $2$-connected $[4, 2]$-graph of order at least seven contains a pancyclic edge
by: Li, Chengli, et al.
Published: (2025)

Canonical colourings in random graphs
by: Kamčev, Nina, et al.
Published: (2023)

Large expander subgraphs in high genus triangulations
by: Lions, Tanguy, et al.
Published: (2026)

Matching Complexes of Outerplanar Graphs
by: Bayer, Margaret, et al.
Published: (2024)

A lower bound on the number of colours needed to nicely colour a sphere
by: Ágoston, Péter
Published: (2024)

On a question about real rooted polynomials and f-polynomials of simplicial complexes
by: Mu, Lili, et al.
Published: (2025)

$5$-list-coloring toroidal $6$-regular triangulations in linear time
by: Balachandran, Niranjan, et al.
Published: (2021)

Nonexistence of Whirling-Knight Tours at Half Coil Count for $n \equiv 4, 6 \pmod 8$
by: Li, Shisheng
Published: (2026)

New type degree conditions for a graph to have a 2-factor
by: Kashima, Masaki
Published: (2025)

Maximizing the number of stars in graphs with forbidden properties
by: Berikkyzy, Zhanar, et al.
Published: (2025)

A Fan-type condition involving bipartite independence number for hamiltonicity in graphs
by: Liu, Hongxi, et al.
Published: (2025)

Minimum-Turn Tours of Even Polyominoes
by: Beluhov, Nikolai
Published: (2025)

Hamiltonian Cycles in Subdivided Doubles
by: Eppstein, David
Published: (2025)

An equality for balanced digraphs
by: Grinberg, Darij, et al.
Published: (2025)

Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected
by: Liu, Feng
Published: (2025)

Hamiltonian cycles passing through matchings in $k$-ary $n$-cubes
by: Liao, Baolai, et al.
Published: (2024)

Ore plus Turán
by: Dawkins, Aleyah, et al.
Published: (2023)

On the girth and connectivity of cubic graphs with a unique longest cycle
by: Jooken, Jorik, et al.
Published: (2024)