Completing colored graphs to meet a target property

DOI10.1007/978-3-642-45043-3_17MaRDI QIDQ2864301zbMATH OpenOpenAlexFDO

Authors Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang

Publication date 6 December 2013

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45043-3_17

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Completing colored graphs to meet a target property
• Chordal bipartite completion of colored graphs
• Some completion problems for graphs without chordless cycles of prescribed lengths
• Bipartite completion of colored graphs avoiding chordless cycles of given lengths
• scientific article; zbMATH DE number 4051024

Cited in

(5)

• Completing colored graphs to meet a target property
• Bipartite completion of colored graphs avoiding chordless cycles of given lengths
• Chordal bipartite completion of colored graphs
• On the complexity of certain completion problems
• scientific article; zbMATH DE number 841628 (Why is no real title available?)

This page was built for publication: Completing colored graphs to meet a target property

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