On the critical point-arboricity graphs

DOI10.1002/jgt.10010zbMath0994.05059OpenAlexW3149732382MaRDI QIDQ2778282

Riste Škrekovski

Publication date: 13 March 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10010

zbMATH Keywords

surfacecoloringcritical graphEuler genuscritical point-arboricity graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Point partition numbers: decomposable and indecomposable critical graphs ⋮ On the vertex arboricity of planar graphs of diameter two ⋮ Generalized DP-colorings of graphs ⋮ Vertex-arboricity of planar graphs without intersecting triangles ⋮ On the vertex-arboricity of planar graphs ⋮ The extremal function for Petersen minors ⋮ Tree coloring of distance graphs with a real interval set ⋮ Circular vertex arboricity ⋮ Vertex arboricity of integer distance graph \(G(D_{m,k})\)

Cites Work

• Excess in critical graphs
• Five-coloring maps on surfaces
• Coloring graphs without short non-bounding cycles
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• The point-arboricity of a graph
• Uniquely k-arborable graphs
• Intersection theorems for systems of sets
• Critical Point-Arboritic Graphs
• Point Arboricity Critical Graphs Exist
• Point-Arboricity and Girth
• The Point-Arboricity of Planar Graphs
• On Graphs with Prescribed Clique Number and Point-Arboricity
• On the number of edges in colour-critical graphs and hypergraphs

This page was built for publication: On the critical point-arboricity graphs