Partitioning graphs into complete and empty graphs

DOI10.1016/J.DISC.2008.06.027MaRDI QIDQ1045126zbMATH OpenOpenAlexFDO

Authors Tınaz Ekim, John Gimbel

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.06.027

zbMATH Keywords

split graphcocoloring(\(j,k\))-coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Complete partitions of graphs
• Complete partitions of graphs
• Partition of a graph with its complete sub-graphs
• Partitions of Graphs
• scientific article; zbMATH DE number 637295
• Partitioning graphs into connected parts
• Partitioning Graphs into Connected Parts
• Partitioning a graph into complementary subgraphs
• Partitioning a graph into complementary subgraphs
• Graph partitioning

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3871392 (Why is no real title available?)
• scientific article; zbMATH DE number 3465328 (Why is no real title available?)
• scientific article; zbMATH DE number 3611388 (Why is no real title available?)
• scientific article; zbMATH DE number 3332242 (Why is no real title available?)
• Combinatorial Relations and Chromatic Graphs
• Graph Classes: A Survey
• Graph Theory and Probability
• List Partitions
• On cocolourings and cochromatic numbers of graphs
• On critical subgraphs of colour-critical graphs
• On split-coloring problems
• On the approximation of Min Split-coloring and Min Cocoloring
• Parallel concepts in graph theory
• Partitioning chordal graphs into independent sets and cliques
• Partitioning cographs into cliques and stable sets
• Partitioning permutations into increasing and decreasing subsequences
• Partitions of graphs into one or two independent sets and cliques
• Small graphs with chromatic number 5: A computer search
• Some extremal results in cochromatic and dichromatic theory
• Some simplified NP-complete graph problems
• Sur le coloriage des graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The complexity of some problems related to GRAPH 3-COLORABILITY
• The strong perfect graph theorem

Cited in

(13)

• On equistable, split, CIS, and related classes of graphs
• Partitioning a graph into two pieces, each isomorphic to the other or to its complement
• Complete partitions of graphs
• Nullspace vertex partition in graphs
• Complete partitions of graphs
• On co-complete \(k\)-partite graph valued functions
• Advances on defective parameters in graphs
• Partition of a graph with its complete sub-graphs
• Colourings, homomorphisms, and partitions of transitive digraphs
• Partitioning a graph into minimum gap components
• Partitioning a graph into complementary subgraphs
• Stable-\(\Pi\) partitions of graphs
• Partitions of graphs into cographs

This page was built for publication: Partitioning graphs into complete and empty graphs

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