Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962995451 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1702.00622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring of \((P_3 \cup P_2)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs / 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: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178952 / 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: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the divisibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2876042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vizing bound for the chromatic number on some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear recognition of pseudo-split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of graphs without certain induced subgraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 15:18, 16 July 2024

scientific article
Language Label Description Also known as
English
Chromatic bounds for some classes of \(2 K_2\)-free graphs
scientific article

    Statements

    Chromatic bounds for some classes of \(2 K_2\)-free graphs (English)
    0 references
    0 references
    0 references
    21 September 2018
    0 references
    chromatic number
    0 references
    clique number
    0 references
    graph classes
    0 references
    \(2 K_2\)-free graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references