scientific article; zbMATH DE number 1124474

DOI10.1002/(SICI)1097-0037(199801)31:1%3C1::AID-NET1%3E3.0.CO;2-NMaRDI QIDQ4378523zbMATH OpenFDO

Authors Michael Jacobson, André E. Kézdy, Jeno Lehel

Publication date 5 March 1998

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199801)31:1%3C1::AID-NET1%3E3.0.CO;2-N

zbMATH Keywords

3-uniform hypergraphdependency graphinduced path-cycle double cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
• Independent dominating and neighborhood sets in triangular graphs
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• On generating triangle-free graphs
• On the complexity of the independent set problem in triangle graphs

Cited in

(1)

• Recognizing intersection graphs of linear uniform hypergraphs

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 Q4378523)