scientific article; zbMATH DE number 524136

MaRDI QIDQ4284625zbMATH OpenFDO

Authors Horst Sachs

Publication date 10 October 1994

zbMATH Keywords

chromatic numbercolouringcycles-plus-triangles theoremHamilton circuit

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 970801
• Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
• An algorithm for identifying cycle-plus-triangles graphs
• An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
• scientific article; zbMATH DE number 434910

Cited in

(15)

• A solution to a colouring problem of P. Erdős
• The graph polynomial and the number of proper vertex colorings
• On the AVDTC of 4-regular graphs
• Proof of the Kalai-Meshulam conjecture
• Cooperative colorings and independent systems of representatives
• An algorithm for identifying cycle-plus-triangles graphs
• scientific article; zbMATH DE number 3920511 (Why is no real title available?)
• General parity result and cycle-plus-triangles graphs
• An asymptotic bound for the strong chromatic number
• scientific article; zbMATH DE number 970801 (Why is no real title available?)
• On finding constrained independent sets in cycles
• Constructing graphs with no independent transversals
• A reduction of the ``cycles plus \(K_4\)'s problem
• An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
• The complexity of finding fair independent sets in cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284625)