Colored problems in graphs

zbMATH Open1136.05051MaRDI QIDQ2474668

Peter Slater

Publication date: 6 March 2008

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

zbMATH Keywords

independent setdominating setcoupled dominationcoupled independence

Mathematics Subject Classification ID

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

Related Items (8)

Title not available (Why is that?) ⋮ Supersaturation problem for color-critical graphs ⋮ 25 pretty graph colouring problems ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ From puzzles to graphs to colorings ⋮ Some colouring problems for Paley graphs

Recommendations

• The \(a\)-graph coloring problem 👍 👎
• A graph coloring problem 👍 👎
• On a graph colouring problem 👍 👎
• The coloring of graphs 👍 👎
• Edge-Coloring Problems for Graphs. 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)