- The distinguishing chromatic number of bipartite graphs of girth at least six
2017/09/28 by Saeid Alikhani, Saeid Alikhani, Samaneh Soltani +2 · 1 citation
Computer Science · Mathematics · #05C15 #05C25 #Bipartite graph #Chromatic scale #Combinatorics #Combinatorics (math.CO) #Conjecture #Discrete mathematics #Edge coloring #Edge-transitive graph #FOS: Mathematics #Foster graph #Girth (graph theory) #Graph #Graph Labeling and Dimension Problems #Graph power #Line graph #Mathematics #Triangle-free graph #Vertex (graph theory) #math.CO #msc:05C15 #msc:05C25
- A census of semisymmetric cubic graphs on up to 768 vertices
2006/05/01 by Marston Conder, Aleksander Malnič, Dragan Marušič +1 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Automorphism #Automorphism group #Coding theory and cryptography #Combinatorics #Cubic graph #Discrete mathematics #Finite Group Theory Research #Foster graph #Graph #Line graph #Mathematics #Quotient #Symmetric graph #Transitive relation #Vertex (graph theory) #Vertex-transitive graph #Voltage graph
- On the chromatic index of outerplanar graphs
1975/02/01 by Stanley Fiorini · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Combinatorics #Computer science #Discrete mathematics #Edge coloring #Foster graph #Graph #Graph Labeling and Dimension Problems #Graph power #Graph theory and applications #Index (typography) #Line graph #Mathematics #Outerplanar graph #Pathwidth