Circle graphs and the cycle double cover conjecture (Q1025572): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123299147, #quickstatements; #temporary_batch_1707303357582
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.2008.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016874427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlace polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interlace polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-variable interlace polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluations of the circuit partition polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph polynomials derived from Tutte-Martin polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results for the Martin polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identities for circuit partition polynomials, with applications to the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the Tutte-Martin connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit decompositions of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3831045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming eulerian trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible circuit decompositions of 4‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of graphs having three pariwise compatible Euler tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the number of Eulerian orientations of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le Polynôme De Martin D'un Graphe Eulerien / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2) Algorithm for Undirected Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank

Latest revision as of 16:12, 1 July 2024

scientific article
Language Label Description Also known as
English
Circle graphs and the cycle double cover conjecture
scientific article

    Statements

    Circle graphs and the cycle double cover conjecture (English)
    0 references
    0 references
    19 June 2009
    0 references
    circle graph
    0 references
    compatibility conjecture
    0 references
    cycle double cover
    0 references
    local complementation
    0 references
    transition system
    0 references
    interlace polynomial
    0 references

    Identifiers