Partitioning graphs into complete and empty graphs
From MaRDI portal
Publication:1045126
DOI10.1016/J.DISC.2008.06.027zbMATH Open1186.05095OpenAlexW1979114268MaRDI QIDQ1045126FDOQ1045126
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
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
- Graph Theory and Probability
- Graph Classes: A Survey
- Sur le coloriage des graphs
- The strong perfect graph theorem
- Some simplified NP-complete graph problems
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Parallel concepts in graph theory
- Partitioning chordal graphs into independent sets and cliques
- Partitions of graphs into one or two independent sets and cliques
- Title not available (Why is that?)
- Combinatorial Relations and Chromatic Graphs
- List Partitions
- Title not available (Why is that?)
- The complexity of some problems related to GRAPH 3-COLORABILITY
- Title not available (Why is that?)
- Partitioning permutations into increasing and decreasing subsequences
- Some extremal results in cochromatic and dichromatic theory
- Small graphs with chromatic number 5: A computer search
- Partitioning cographs into cliques and stable sets
- Title not available (Why is that?)
- On split-coloring problems
- On cocolourings and cochromatic numbers of graphs
- On critical subgraphs of colour-critical graphs
- On the approximation of Min Split-coloring and Min Cocoloring
- Title not available (Why is that?)
Cited In (13)
- Partitioning a graph into two pieces, each isomorphic to the other or to its complement
- On equistable, split, CIS, and related classes of graphs
- 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)
