Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Complete description of forbidden subgraphs in the structural domination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Bipartite Subgraphs in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination properties and induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of graphs dominated by induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring and list three-coloring of graphs without induced paths on seven vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect coloring and linearly χ-boundP6-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect divisibility and 2‐divisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the hypergraph of maximal cliques of a graph with no long path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of \(P_{6}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity results on \(k\)-coloring \(P_t\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square-Free Graphs with No Six-Vertex Induced Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Comparability Graph of a Tree / rank
 
Normal rank

Revision as of 10:29, 24 July 2024

scientific article
Language Label Description Also known as
English
Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
scientific article

    Statements

    Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 January 2021
    0 references
    structural domination
    0 references
    \( P_7\)-free graphs
    0 references
    split graphs
    0 references
    chromatic number
    0 references
    clique number
    0 references

    Identifiers