Vertex colorings without isolates

DOI10.1016/0095-8956(79)90020-0zbMath0351.05108OpenAlexW1970586838MaRDI QIDQ1235179

Stephen B. Maurer

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90020-0

zbMATH Keywords

vertex colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Graph decomposition with constraints in the minimum degree ⋮ Balanced graphs with minimum degree constraints ⋮ On k-critical, n-connected graphs ⋮ Bipartition of graph under degree constraints ⋮ On k-minimally n-edge-connected graphs ⋮ A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH ⋮ Graph partitions with minimum degree constraints ⋮ Graph decompositions without isolates ⋮ Graphical decompositions

Cites Work

• Hamiltonian circuits in random graphs
• On k-critical, n-connected graphs
• On k-minimally n-edge-connected graphs
• A homology theory for spanning tress of a graph
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex colorings without isolates