Colored problems in graphs

MaRDI QIDQ2474668zbMATH OpenFDO

Authors Peter Slater

Publication date 6 March 2008

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

dominating setindependent setcoupled dominationcoupled independence

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Graph coloring problems
• scientific article; zbMATH DE number 821271
• A graph coloring problem
• The coloring of graphs
• Edge-Coloring Problems for Graphs.
• On a graph colouring problem
• Graph colorings
• The \(a\)-graph coloring problem

Cited in

(13)

• scientific article; zbMATH DE number 2170484 (Why is no real title available?)
• From puzzles to graphs to colorings
• Some colouring problems for Paley graphs
• Colored-independence on paths
• 25 pretty graph colouring problems
• Colored-independence (mostly) on trees
• scientific article; zbMATH DE number 5302772 (Why is no real title available?)
• Colored and proper-colored-domination
• scientific article; zbMATH DE number 5972368 (Why is no real title available?)
• scientific article; zbMATH DE number 1784918 (Why is no real title available?)
• Supersaturation problem for color-critical graphs
• Graph problems with obligations
• From combinatorial problems to graph colorings

This page was built for publication: Colored problems in graphs

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