The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (Q2339429): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2015.01.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997809309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the clique-transversal number of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering all cliques of a chordal graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on maximal and maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the cliques of a graph with vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets and matchings in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the clique-transversal number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-transversal sets in 4-regular claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering all cliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:55, 9 July 2024

scientific article
Language Label Description Also known as
English
The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
scientific article

    Statements

    The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (English)
    0 references
    0 references
    0 references
    0 references
    1 April 2015
    0 references
    clique
    0 references
    clique-transversal number
    0 references
    claw-free graphs
    0 references
    4-regular graphs
    0 references

    Identifiers