Some bounds on the size of maximum G-free sets in graphs (Q6174763): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114071630, #quickstatements; #temporary_batch_1719433555324
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1142/s1793830922501324 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4291014513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of \(G\)-free colourability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced forests in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling numbers of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the independence number of a graph and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with unique maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Maximal Independent Sets in Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximum independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, odd girth, and average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4912130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus–Gaddum problem in terms of G-free coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum induced forests of a connected cubic graph without triangles / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1142/S1793830922501324 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:08, 30 December 2024

scientific article; zbMATH DE number 7713053
Language Label Description Also known as
English
Some bounds on the size of maximum G-free sets in graphs
scientific article; zbMATH DE number 7713053

    Statements

    Identifiers