Pages that link to "Item:Q4097312"
From MaRDI portal
The following pages link to Every planar map is four colorable (Q4097312):
Displaying 50 items.
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
- Edge-coloring of plane multigraphs with many colors on facial cycles (Q2185732) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Facial achromatic number of triangulations on the sphere (Q2279973) (← links)
- Edge-partition and star chromatic index (Q2335139) (← links)
- Unique-maximum edge-colouring of plane graphs with respect to faces (Q2341735) (← links)
- Dominated colorings of graphs (Q2345536) (← links)
- Homomorphism bounded classes of graphs (Q2368718) (← links)
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking (Q2398438) (← links)
- Even-cycle decompositions of graphs with no odd-\(K_4\)-minor (Q2400967) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← links)
- Strong chromatic index of \(K_4\)-minor free graphs (Q2410582) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs (Q2444142) (← links)
- Bounds on the connected domination number of a graph (Q2446883) (← links)
- A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
- Book embedding of locally planar graphs on orientable surfaces (Q2629277) (← links)
- From realizability to induction via dependent intersection (Q2636522) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- Facial unique-maximum edge and total coloring of plane graphs (Q2659070) (← links)
- Entire coloring of 2-connected plane graphs (Q2662784) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Improved square coloring of planar graphs (Q2685324) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Local neighbor-distinguishing index of graphs (Q2693079) (← links)
- Chromatic numbers of quadrangulations on closed surfaces (Q2744570) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- A survey of graph coloring - its types, methods and applications (Q2978431) (← links)
- Coloring plane graphs with independent crossings (Q3055915) (← links)
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings (Q3161084) (← links)
- Cyclic 4-Colorings of Graphs on Surfaces (Q3188662) (← links)
- A Five-Color Theorem for Graphs on Surfaces (Q3320404) (← links)
- Colouring Random Empire Trees (Q3599154) (← links)
- On Neighbourly Triangulations (Q3672730) (← links)
- On the chromatic number of binary matroids (Q3852199) (← links)
- (Q3879256) (← links)
- Zig-zag facial total-coloring of plane graphs (Q4561211) (← links)
- The Zambelli Attractors of Coupled, Nonlinear Macrodynamics and Knot Theory (Q5011357) (← links)
- Asymptotic dimension of planes and planar graphs (Q5047910) (← links)
- Complete Minors in Graphs Without Sparse Cuts (Q5068162) (← links)
- (Q5076791) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Topological Graph Theory: A Personal Account (Q5300972) (← links)
- Some Conjectures and Questions in Chromatic Topological Graph Theory (Q5506783) (← links)
- (Q5708606) (← links)
- Steinberg-like theorems for backbone colouring (Q5890934) (← links)
