Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2013.09.012 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A counterexample to the rank-coloring conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3643736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank of a graph after vertex addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spektren endlicher Grafen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with maximum nullity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number and the 2-rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of a graph with cut-points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity and the matching number of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of line graphs of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of graphs of nullity one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nut and core singular fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound for the Chromatic Number of a Graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2013.09.012 / rank
 
Normal rank

Latest revision as of 12:31, 19 December 2024

scientific article
Language Label Description Also known as
English
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
scientific article

    Statements

    Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (English)
    0 references
    0 references
    0 references
    18 February 2014
    0 references
    rank of graphs
    0 references
    matching number
    0 references
    chromatic index
    0 references
    independence number
    0 references

    Identifiers